Other Buds in Membrane Computing

It is well-known the huge Mario’s contribution to the development of Membrane Computing. Many researchers may relate his name to the theory of complexity classes in P systems, the research of frontiers of the tractability or the application of Membrane Computing to model real-life situations as the Quorum Sensing System in Vibrio fischeri or the Bearded Vulture ecosystem. Beyond these research areas, in the last years Mario has presented many new research lines which can be considered as buds in the robust Membrane Computing tree. Many of them were the origin of new research branches, but some others are still waiting to be developed. This paper revisits some of these buds

A Characterization of PSPACE with Antimatter and Membrane Creation

The use of negative information provides a new tool for exploring the limits of P systems as computational devices. In this paper we prove that the combination of antimatter and annihilation rules (based on the annihilation of physical particles and antiparticles) and membrane creation (based on autopoiesis) provides a P system model able to solve PSPACE-complete problems. Namely, we provide a uniform family of P system in such P system model which solves the satis ability problem for quanti ed Boolean formulas (QSAT). In the second part of the paper, we prove that all the decision problems which can be solved with this P system model belong to the complexity class PSPACE, so this P system model characterises PSPACE.Ministerio de Economía y Competitividad TIN2012-3743

A Case Study in (Mem)Brane Computation: Generating Squares of Natural Numbers

The aim of this paper is to start an investigation and a comparison of the expressiveness of the two most relevant formalisms inspired by membranes interactions, namely, P systems and Brane Calculi. We compare the two formalisms with respect to their ability to act as generator devices. In particular, we show different ways of generating the set L = {n2 | n ≥ 1} in P systems and in Brane Calculi.Ministerio de Educación y Ciencia TIN2005-09345-C03-01Junta de Andalucía TIC-58

Performing Arithmetic Operations with Spiking Neural P Systems

We consider spiking neural P systems as devices which can be used to perform some basic arithmetic operations, namely addition, subtraction, comparison and multiplication by a fixed factor. The input to these systems are natural numbers expressed in binary form, encoded as appropriate sequences of spikes. A single system accepts as inputs numbers of any size. The present work may be considered as a ¯rst step towards the design of a CPU based on the working of spiking neural P systems.Ministerio de Educación y Ciencia TIN2006–13425Junta de Andalucía P08-TIC-0420

A Case Study in (Mem)Brane Computation: Generating {n2 | n 1}

The aim of this paper is to start an investigation and a comparison of the expressiveness of the two most relevant formalisms inspired by membranes interactions, namely, P systems and Brane Calculi. We compare the two formalisms w.r.t. their ability to act as language generators. In particular, we show different ways of generating the set L = {n2 | n 1} in P systems and in Brane Calculi.Ministerio de Educación y Ciencia TIC2002-04220-C03-0

Some Notes on (Mem)Brane Computation

Membrane Computing and Brane Calculi are two recent computational paradigms in the framework of Natural Computing. They are based on the study of the structure and functioning of living cells as living organisms able to process and generate information. In this paper we give a short introduction to both areas and point out some open research lines.Ministerio de Educación y Ciencia TIN2005-09345-C04-01Junta de Andalucía TIC-58

An Application of Genetic Algorithms to Membrane Computing

The process of designing a P system in order to perform a task is a hard job. The researcher has often only an approximate idea of the design, but finding the exact description of the rules is a heavy hand-made work. In this paper we introduce PSystemEvolver, an evolutionary algorithm based on generative encoding, that could help to design a P system to perform a specific task. We illustrate the use of PSystemEvolver with a simple mathematical problem: the computation of squared numbers.Ministerio de Ciencia e Innovación TIN2008-04487-EMinisterio de Ciencia e Innovación TIN-2009-13192Junta de Andalucía P08-TIC-0420

The Pole Balancing Problem with Enzymatic Numerical P Systems

Pole balancing is a control benchmark widely used in engineering. It involves a pole a xed to a cart via a joint which allows movement along a single axis. In this problem, the movement of the cart is restricted to the horizontal axis by a track and the pole is free to move about the horizontal axis of the pivot. The system is extremely unstable and, the cart must be in constant movement in order to preserve the equilibrium and avoid the fall of the pendulum. In this paper, we study the pole balancing problem in the framework of Enzymatic Numerical P Systems and provide some clues for using them in more complex systems.Ministerio de Economía y Competitividad TIN2012-3743

A Software Tool for Dealing with Spiking Neural P Systems

Software simulators for P system are nowadays the main tool to carry out experiments in the eld of Membrane Computing. Although the simulation of a P system is a quite complex task, current simulators have been successfully used for pedagogical purposes and also as assistant tools for researchers. In this paper we present a rst software tool for dealing with Spiking Neural P Systems. This tool outputs the transition diagram of a given system in a step-by-step mode. The code is modular and exible enough to be adapted for further research tasks.Ministerio de Educación y Ciencia TIN2005-09345-C04-01Junta de Andalucía TIC-58

Semantics of Deductive Databases in a Membrane Computing Connectionist Model

The integration of symbolic reasoning systems based on logic and connectionist systems based on the functioning of living neurons is a vivid research area in computer science. In the literature, one can found many e orts where di erent reasoning systems based on di erent logics are linked to classic arti cial neural networks. In this paper, we study the relation between the semantics of reasoning systems based on propositional logic and the connectionist model in the framework of membrane computing, namely, spiking neural P systems. We prove that the xed point semantics of deductive databases and the immediate consequence operator can be implemented in the spiking neural P systems model